Some t-homogeneous sets of permutations
نویسندگان
چکیده
منابع مشابه
Some t-Homogeneous Sets of Permutations
Perpendicular Arrays are ordered combinatorial structures, which recently have found applications in cryptography. A fundamental construction uses as ingredients combinatorial designs and uniformly t-homogeneous sets of permutations. We study the latter type of objects. These may also be viewed as generalizations of t-homogeneous groups of permutations. Several construction techniques are given...
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملHomogeneous Permutations
There are just five Fraı̈ssé classes of permutations (apart from the trivial class of permutations of a singleton set); these are the identity permutations, reversing permutations, composites (in either order) of these two classes, and all permutations. The paper also discusses infinite generalisations of permutations, and the connection with Fraı̈ssé’s theory of countable homogeneous structures,...
متن کاملLarge sets of t-designs from t-homogeneous groups
A direct method for constructing large sets of t-designs is based on the concept of assembling orbits of a permutation group G on ksubsets of a v-set into block sets of t-designs so that these designs form a large set. If G is t-homogeneous, then any orbit is a t-design and therefore we obtain a large set by partitioning the set of orbits into parts consisting of the same number of k-subsets. I...
متن کاملOn t-intersecting families of signed sets and permutations
A family A of sets is said to be t-intersecting if any two sets in A contain at least t common elements. A t-intersecting family is said to be trivial if there are at least t elements common to all its sets. Let X be an r-set {x1, ..., xr}. For k ≥ 2, we de ne SX,k and S∗ X,k to be the families of k-signed r-sets given by SX,k := {{(x1, a1), ..., (xr, ar)} : a1, ..., ar are elements of {1, ...,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 1996
ISSN: 0925-1022,1573-7586
DOI: 10.1007/bf00169771